Online Dynamic Power Management with Hard Real-Time Guarantees

نویسندگان

  • Jian-Jia Chen
  • Mong-Jen Kao
  • D. T. Lee
  • Ignaz Rutter
  • Dorothea Wagner
چکیده

We consider the problem of online dynamic power management that provides hard real-time guarantees for multi-processor systems. In this problem, a set of jobs, each associated with an arrival time, a deadline, and an execution time, arrives to the system in an online fashion. The objective is to compute a non-migrative preemptive schedule of the jobs and a sequence of power on/off operations of the processors so as to minimize the total energy consumption while ensuring that all the deadlines of the jobs are met. We assume that we can use as many processors as necessary. In this paper we examine the complexity of this problem and provide online strategies that lead to practical energy-efficient solutions for real-time multi-processor systems. First, we consider the case for which we know in advance that the set of jobs can be scheduled feasibly on a single processor. We show that, even in this case, the competitive factor of any online algorithm is at least 2.06. On the other hand, we give a 4-competitive online algorithm that uses at most two processors. For jobs with unit execution times, the competitive factor of this algorithm improves to 3.59. Second, we relax our assumption by considering as input multiple streams of jobs, each of which can be scheduled feasibly on a single processor. We present a trade-off between the energyefficiency of the schedule and the number of processors to be used. More specifically, for k given job streams and h processors with h > k, we give a scheduling strategy such that the energy usage is at most 4 · ⌈ k h−k ⌉ times that used by any schedule which schedules each of the k streams on a separate processor. Finally, we drop the assumptions on the input set of jobs. We show that the competitive factor of any online algorithm is at least 2.28, even for the case of unit job execution times for which we further derive an O(1)-competitive algorithm. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Power-Managing Strategy with Hard Real-Time Guarantees

We consider the problem of online dynamic power management that provides hard realtime guarantees. In this problem, each of the given jobs is associated with an arrival time, a deadline, and an execution time, and the objective is to decide a schedule of the jobs as well as a sequence of state transitions on the processors so as to minimize the total energy consumption. In this paper, we examin...

متن کامل

Energy-conscious, deterministic I/O device scheduling in hard real-time systems

Energy consumption is an important design parameter for embedded and portable systems. Software-controlled (or dynamic) power management (DPM) has emerged as an attractive alternative to inflexible hardware solutions. However, DPM via I/O device scheduling for real-time systems has not been considered before. We present an online I/O device scheduler, which we call lowenergy device scheduler (L...

متن کامل

System-Level Energy Management for Real-Time Systems

SYSTEM-LEVEL ENERGY MANAGEMENT FOR REAL-TIME SYSTEMS Vinay Devadas, PhD George Mason University, 2011 Dissertation Director: Dr. Hakan Aydin Energy management has recently become one of the key dimensions in the design of real-time embedded systems. While early studies focused separately on individual energy management techniques targeting different system components, there is growing interest ...

متن کامل

Hard Real-Time Garbage-Collection in the Jamaica Virtual Machine

Java S automatic memory management is the main reason that prevents Java from being used in hard realtime environments. We present the garbage collection mechanism that is used by the Jamaica Virtual Machine, an implementation of the Java Virtual Machine Specification. This mechanism differs significantly from existing implementations in the way threads are implemented, root references are foun...

متن کامل

Integrated Device Scheduling and Processor Voltage Scaling for System-wide Energy Conservation

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Previous research has focused on power conservation for either the processor or I/O devices alone. The system-wide energy conservation has received little attention. In this paper, we analyze the problem of system-wide energy-efficient scheduling for hard real-t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 595  شماره 

صفحات  -

تاریخ انتشار 2014